package Java.com.wang.Tre;

public class Q {
    public static void main(String[] args) {
        //Node<Character> A =new Node<Character>('A');
        //Node<Character> A =new Node<Character>('A');
        Node<Character> B = new Node<Character>('B');
        Node<Character> C = new Node<Character>('C');
        Node<Character> D = new Node<Character>('D');
        Node<Character> E = new Node<Character>('E');
        Node<Character> F = new Node<Character>('F');
        Node<Character> G = new Node<Character>('G');
        BinaryTree bt1 = new BinaryTree('A');
        Node<Character> A = bt1.getroot();
        //Node<Character> bt1n =bt1.insertLeft('A',bt1.A);
        bt1.insertLeft(B, A);
        bt1.insertLeft(E, B);
        bt1.insertRight(F, B);
        bt1.insertRight(C, A);
        bt1.insertRight(G, C);
        System.out.println("----------------------------------------------------");
        //System.out.println(A);
        bt1.getall(bt1.getroot());
        bt1.getroot().getData();
        System.out.println("----------------------------------------------------");
    }
}
